Divide and conquer algorithms - PDFSEARCH.IO - Document Search Engine

Divide and conquer algorithms
Results: 51

#	Item
31	Introduction COMS21103 Dynamic programming is a way of finding efficient algorithms for problems which can be broken down into simpler, overlapping subproblems. Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-01-08 09:09:07 Operations research Computer programming Mathematical optimization Theoretical computer science Mathematical logic Algorithm Divide and conquer algorithm Overlapping subproblems Recursion Dynamic programming Mathematics Applied mathematics
32	CS 330 – Spring 2013, Assignment 4 Problems due at beginning of class, Thursday, March 21 at 11AM. Question 1. Suppose you are choosing between the following three algorithms, all of which have O(1) base cases for size Add to Reading List Source URL: www.cs.bu.edu Language: English - Date: 2013-03-16 20:16:53 Matrices Operations research Analysis of algorithms Linear algebra Toeplitz matrix Algorithm Divide and conquer algorithm Huffman coding Matrix Mathematics Theoretical computer science Applied mathematics
33	A Dynamically Tuned Sorting Library ´ Garzar´an, and David Padua Xiaoming Li, Mar´ıa Jesus University of Illinois at Urbana-Champaign xli15, garzaran, padua@cs.uiuc.edu http://polaris.cs.uiuc.edu Add to Reading List Source URL: www.cgo.org Language: English - Date: 2013-04-27 13:55:02 Combinatorics Merge sort Radix sort Quicksort Heapsort Counting sort Divide and conquer algorithm Selection algorithm Insertion sort Sorting algorithms Order theory Mathematics
34	§1. Algorithmics Lecture I Page 1 Add to Reading List Source URL: cs.nyu.edu Language: English - Date: 2013-04-13 15:02:34 Computational complexity theory Operations research Algorithms Models of computation Decision tree model Sorting algorithm Linear programming Divide and conquer algorithm Time complexity Theoretical computer science Applied mathematics Mathematics
35	Revisiting the Cache Miss Analysis of Multithreaded Algorithms ⋆ Richard Cole1 and Vijaya Ramachandran2 1 Computer Science Dept., Courant Institute, NYU, New York, NY 10012. Add to Reading List Source URL: cs.nyu.edu Language: English - Date: 2013-01-31 17:59:40 Cache B-tree Algorithms CPU cache Central processing unit Computer memory Parallel computing Fast Fourier transform Divide and conquer algorithm Mathematics Computing Applied mathematics
36	§1. Algorithmics Lecture I Page 1 Add to Reading List Source URL: cs.nyu.edu Language: English - Date: 2012-09-24 18:59:56 Computational complexity theory Operations research Algorithms Models of computation Decision tree model Sorting algorithm Linear programming Divide and conquer algorithm Pointer machine Theoretical computer science Mathematics Applied mathematics
37	Algorithms Wikibooks.org March 15, 2013 Add to Reading List Source URL: upload.wikimedia.org Language: English - Date: 2013-10-05 14:36:00 Search algorithms Operations research Mathematical optimization Algorithms Mathematical logic String Dynamic programming Binary search algorithm Divide and conquer algorithm Mathematics Applied mathematics Theoretical computer science
38	Microsoft Word - unpluggedDec2006-1.doc Add to Reading List Source URL: csunplugged.org Language: English - Date: 2009-10-19 03:33:56 Combinatorics Quicksort Insertion sort Merge sort Bubble sort Sorting Divide and conquer algorithm Selection sort Sort Sorting algorithms Order theory Mathematics
39	Activity 7 Lightest and heaviest—Sorting algorithms Age group Early elementary and up. Abilities assumed Using balance scales, ordering. Add to Reading List Source URL: csunplugged.org Language: English - Date: 2009-10-19 03:19:37 Combinatorics Insertion sort Quicksort Merge sort Sorting Bubble sort Selection sort Heapsort Divide and conquer algorithm Sorting algorithms Order theory Mathematics
40	PetaBricks: A Language and Compiler for Algorithmic Choice Jason Ansel Cy Chan Yee Lok Wong Marek Olszewski Add to Reading List Source URL: groups.csail.mit.edu Language: English - Date: 2009-04-02 22:41:46 Applied mathematics Algorithm Divide and conquer algorithm Quicksort Radix sort Merge sort Fast Fourier transform Parallel computing Dynamic programming Mathematics Sorting algorithms Order theory